Pattern Matching
نویسنده
چکیده
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques, and how simpler patterns can be dealt with more simply and efficiently. We consider exact as well as approximate pattern matching. Also, we cover both sequential searching, where the sequence cannot be preprocessed, and indexed searching, where we have a data structure built over the sequence to speed up the search.
منابع مشابه
Local Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching
Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...
متن کاملNeighborhood matrix: A new idea in matching of two dimensional gel images
Automated data analysis and pattern recognition techniques are the requirements of biological and proteomicsresearch studies. The analysis of proteins consists of some stages among which the analysis of two dimensionalelectrophoresis (2-DE) images is crucial. The aim of image capturing is to generate a Photostat that can be used infuture works such as image comparison. The researchers introduce...
متن کاملAbelian pattern matching in strings
Abelian pattern matching is a new class of pattern matching problems. In abelian patterns, the order of the characters in the substrings does not matter, e.g. the strings abbc and babc represent the same abelian pattern a+2b+c. Therefore, unlike classical pattern matching, we do not look for an exact (ordered) occurrence of a substring, rather the aim here is to find any permutation of a given ...
متن کاملA Multi-pattern Matching Algorithm Based on WM Algorithm
The research on the algorithms of pattern-matching is an important subject in the field of computer study. The algorithms can range from single-pattern matching and multipattern matching algorithms to extended characters matching and regular expression. Among the many multi-pattern matching algorithms, AC algorithm and WM algorithm would be the two most classical algorithms, but these two algor...
متن کاملPattern Matching Acceleration for Network Intrusion Detection Systems
Pattern matching is one of critical parts of Network Intrusion Detection Systems (NIDS). Pattern matching is computationally intensive. To handle an increasing number of attack signature patterns, a NIDS require a multi-pattern matching method that can meet the line-speed of packet transfer. The multipattern matching method should efficiently handle a large number of patterns with a wide range ...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002